Method and device for separating a mixture of source signals

ABSTRACT

Device and method for separating a mixture of source signals to regain the source signals, the device and method being based on measured signals, the invention comprises: bringing each measured signal to a separation structure including an adaptive filter, the adaptive filter comprising filter coefficients; using a generalized criterion function for obtaining the filter coefficients, the generalized criterion function comprising cross correlation functions and a weighting matrix, the cross correlation functions being dependent on the filter coefficients; estimating the filter coefficients, the resulting estimates of the filter coefficients corresponding to a minimum value of the generalized criterion function; and updating the adaptive filter with the filter coefficients.

TECHNICAL FIELD

[0001] The present inventions relates to a metod and device for separating a mixture of source signals to regain the source signals.

BACKGROUND OF THE INVENTION

[0002] In recent time several papers concerning signal separation of dynamically mixed source signals have been put forward [1-3, 8, 17, 19, 20]. In principle it is possible to separate the sources exploiting only second order statistics, cf. [8]. The blind signal separation problem with dynamic/convolutive mixtures is solved in the frequency domain in several papers presented, cf. [3, 20]. Basically, dynamic source separation in the frequency domain aims to solve a number of static/instantaneous source separation problems, one for each frequency bin in question. In order to obtain the dynamic channel system (mixing matrix), the estimates corresponding to different frequencies bins, have to be interpolated. This procedure seems to be a nontrivial task, due to scaling and permutation indeterminacies [16]. The approach in the present paper is a “time-domain approach”, see [8], which models the elements of the channel system with Finite Impulse Response (FIR) filters, thus avoiding this indeterminacies.

[0003] A quasi-maximum likelihood method for signal separation by second order statistics is presented by Pham and Garat in [11]. An algorithm is presented for static mixtures, i.e. mixing matrices without delays. Each separated signal s_(i) i=1, . . . , M is filtered with a Linear Time Invariant (LTI) filter h_(i). The criterion used is the estimated cross-correlations for these filtered signals. The optimal choice of the filter h_(i), according to [11], is the filter with frequency response inversely proportional to the spectral density of the corresponding source signal. The filters h_(i), i=1, . . . , M are thus whitening filters. However, the spectral densities of the source signals are usually unknown, and perhaps time varying. One approach is to estimate these filters as done in the present paper and in the prediction error method as presented in [1]. Moreover, several aspects of the algorithm presented in [8] remained open.

SUMMARY OF THE INVENTION

[0004] Characterizing features of the present invention, i.e. the method for separating a mixture of source signals to regain the source signals; are bringing each measured signal to a separation structure including an adaptive filter, the adaptive filter comprising filter coefficients; using a generalised criterion function for obtaining the filter coefficients, the generalised criterion function comprising cross correlation functions and a weighting matrix, the cross correlation functions being dependent on the filter coefficients; estimating the filter coefficients, the resulting estimates of the filter coefficients corresponding to a minimum value of the generalised criterion function; and updating the adaptive filter with the filter coefficients.

[0005] Other characterizing features of the present invention, i.e. the device for separating a mixture of source signals to regain the source signals, the input to the device being based on measured signals, the device comprises: signaling links for bringing each measured signal to a separation structure including an adaptive filter, the adaptive filter comprising filter coefficients; a generalised criterion function means for obtaining the filter coefficients, the generalised criterion function means comprising cross correlation functions and a weighting matrix, the cross correlation functions being dependent on the filter coefficients; means for estimating the filter coefficients, the resulting estimates of the filter coefficients corresponding to a minimum value output of the generalised criterion function; and updating means for updating the adaptive filter with the filter coefficients.

[0006] Specific fields of application of the present invention include mobile telephone technology, data communication, hearing aids and medical measuring equipment, such as ECG. Also included is echo cancelling which can primarily occur in the telecommunications field.

BRIEF DESCRIPTION OF THE DRAWINGS

[0007]FIG. 1 shows the empirical and true parameter variances of a preferred embodiment of the present invention compared to a prior art signal separation algorithms.

[0008]FIG. 2 shows the estimated mean value as a function of relative frequency of a preferred embodiment of the present invention compared to a prior art signal separation algorithm.

[0009]FIG. 3, shows the parameter variances as a function of relative frequency of a preferred embodiment of the present invention compared to a prior art signal separation algorithm.

DESCRIPTION OF PREFERRED EMBODIMENTS

[0010] In the present invention a signal separation algorithm is derived and presented. A main result of the analys is an optimal weighting matrix. The weighting matrix is used to device a practical algorithm for signal separation of dynamically mixed sources. The derived algorithm significantly improves the parameter estimates in cases where the sources have similar color. In addition the statistical analysis can be used to reveal attainable (asymptotic) parameter variance given a number of known parameters.

[0011] The basis for the source signals, in the present paper, are M mutually uncorrelated white sequences. These white sequences are termed source generating signals and denoted by ξ_(k)(n) where k=1, . . . , M. The source generating signals are convolved with linear time-invariant filters G_(k)(q)/F_(k)(q) and the outputs are,

x(n)=[x _(i)(n) . . . x _(M)(n)]^(T) =K(q)ξ(n)

[0012] $\begin{matrix} {{x(n)} = \quad {\left\lbrack {{x_{1}(n)}\quad \ldots \quad {x_{M}(n)}} \right\rbrack^{T} = {{K(q)}{\xi (n)}}}} \\ {{= \quad {{diag}\quad {\left( {\frac{G_{1}(q)}{F_{1}(q)},\quad \ldots \quad,\frac{G_{M}(q)}{F_{M}(q)}} \right)\begin{bmatrix} {\xi_{1}(n)} \\ \vdots \\ {\xi_{M}(n)} \end{bmatrix}}}},} \end{matrix}$

[0013] referred to as the source signals and where q and T is the time shift operator and matrix transpose, respectively. The following assumptions are introduced

[0014] A1. The generating signal ξ(n) is a realization of a stationary, white zero-mean Gaussian process:

ξ(n)εN(0, Σ), Σ=diag(σ₁ ², . . . σ_(M) ²)

[0015] A2. The elements of K(q) are filters which are asymptotically stable and have minimum phase.

[0016] Condition A1 is somewhat restrictive because of the Gaussian assumption. However, it appears to be very difficult to evaluate some of the involved statistical expectations unless the Gaussian assumption is invoked.

[0017] The source signals x(n) are unmeasurable and inputs to a system, referred to as the channel system. The channel system produces M outputs collected in a vector y(n)

y(n)=[y ₁(n) . . . y _(M)(n)]^(T) =B(q)x(n).

[0018] which are measurable and referred to as the observables. In the present paper the channel system, B(q), given in ${{B(q)} = \left\lbrack \quad \begin{matrix} 1 & {B_{12}(q)} & \cdots & {B_{1M}(q)} \\ {B_{21}(q)} & ⋰ & \quad & \vdots \\ \vdots & \cdot & ⋰ & {B_{{({M - 1})}M}(q)} \\ {B_{M1}(q)} & \cdots & {B_{M{({M - 1})}}(q)} & 1 \end{matrix}\quad \right\rbrack},$

[0019] where B_(ij)(q), ij=1, . . . M are FIR filters. The objective is to extract the source signals from the observables. The extraction can be accomplished by means of all adaptive separation structure, cf. [8]. The inputs to the separation structure are the observable signals. The output from the separation structure, s₁(n), . . . ,s_(M)(n), depend on the adaptive filters, D_(ij)(q, θ), i, j=1, . . . M, and can be written as

s(n, θ)=[s ₁(n, θ) . . . s _(M)(n, θ)]^(T) =D(q, θ)y(n),

[0020] where θ is a parameter vector containing the filter coefficients of the adaptive filters. That is the parameter vector is θ=[d₁₁ ^(T) . . . d_(MM) ^(T)]^(T) where d_(ij), i, j=1, . . . M are vectors containing the coefficients of D_(ij)(q, θ), i, j=1, . . . M, respectively. Note, that unlike B(q) the separation matrix D(q, θ) does not contain a fixed diagonal, cf. [6, 13].

[0021] Most of the expressions and calculations in the present paper will be derived for the two-input two-output (TITO) case, M=2. The main reason for using the TITO case is that it has been shown to be parameter identifiable under a set of conditions, cf. [8]. However, the analysis in the current paper is applicable on the more general multiple-input multiple-output (MIMO) case, assuming that problem to be parameter identifiable as well.

[0022] Assuming that N samples of y₁(n) and y₂(n) are available, the criterion function proposed in [8], reads as $\quad {{{\overset{\_}{V}(\theta)} = {\sum\limits_{k = {- U}}^{U}{{\overset{\_}{R}}_{s_{1}s_{2}}^{2}\left( {k;\theta} \right)}}},}$

[0023] where ${{{\overset{\_}{R}}_{s_{1}s_{2}}\left( {k;\theta} \right)} = {\frac{1}{N}{\sum\limits_{n = 0}^{N - k - 1}\quad {{s_{1}\left( {n;\theta} \right)}{s_{2}\left( {{n + k};\theta} \right)}}}}},{k = 0},\quad \ldots \quad,{U.}$

[0024] To emphasize the dependence on θ equation (2.6) can be rewritten as ${{{\overset{\_}{R}}_{s_{1}s_{2}}\left( {k;\theta} \right)} = {{{\overset{\_}{R}}_{y_{1}y_{2}}(k)} - {\sum\limits_{i}{{d_{12}(i)}{{\overset{\_}{R}}_{y_{2}y_{2}}\left( {k - i} \right)}}} - {\sum\limits_{i}{{d_{21}(i)}{{\overset{\_}{R}}_{y_{1}y_{1}}\left( {k + i} \right)}}} + {\sum\limits_{i}{\sum\limits_{l}{{d_{12}(i)}{d_{21}(l)}{{\overset{\_}{R}}_{y_{2}y_{1}}\left( {k - i + l} \right)}}}}}},$

[0025] where the notation d₁₂(i) denotes the i:th coefficient of the filter D₁₂(q).

[0026] For notational simplicity, introduce the following vector as

{dot over (r)} _(N)(θ)=[{dot over (R)}, ₁,₂(−U, θ) . . . {dot over (R)}, ₁,₂(U, θ)]^(T)

[0027] where the subscript N indicates that the estimated cross-covariances are based on N samples. Furthermore, introduce a positive definite weighting matrix W(θ) which possibly depends on θ too. Thus, the criterion, in equation (2.6), can be generalized as

V _(N)(θ)= ${{V_{N}(\theta)} = {\frac{1}{2}{{\overset{\_}{r}}_{N}^{T}(\theta)}{W(\theta)}{{\overset{\_}{r}}_{N}(\theta)}}},$

^(T) _(V)(θ)V(θ){dot over (r)} _(N)(θ),

[0028] which will be investigated. Note, the studied estimator is closely related to the type of non-linear regressions studied in [15]. The estimate of the parameters of interest are obtained as ${\hat{\theta}}_{N} = {\arg \quad {\min\limits_{\theta}{{V_{N}(\theta)}.}}}$

[0029] Although the signal separation based on the criterion (2.6) has been demonstrated to perform well in practice, see for example [12], there are a couple of open problems in the contribution [8];

[0030] 1. It would be interesting to find the asymptotic distribution of the estimate of θ_(N). Especially, an expression for the asymptotic covariance matrix is of interest. One reason for this interest, is that the user can investigate the performance for various mixing structures, without performing simulations. Potentially, further insight could be gained into what kind of mixtures that are difficult to separate. The asymptotic covariance matrix would also allow the user to compare the performance with the Cramér-Rao Lower bound (CRB), primarily to investigate how far from the optimal performance of the prediction error method the investigated method is. An investigation of the CRB for the MIMO scenario can be found in [14].

[0031] 2. How should the weighting matrix W(θ) be chosen for the best possible (asymptotic) accuracy? Given the best possible weighting, and the asymptotic distribution, one can further investigate in which scenarios it is worthwhile applying a weighting W(θ)≠32 I, where I denotes the identity matrix.

[0032] The purpose of the present contribution is to

[0033] Find the asymptotic distribution of the estimate of θ_(N).

[0034] Find the weighting matrix W(θ) that optimizes the asymptotic accuracy.

[0035] Study an implementation of the optimal weighting scheme.

[0036] In addition to A1 and A2 the following assumptions are considered to hold throughout the description:

[0037] A3. Assume that the conditions C3-C6 in [8] are fulfilled, so that the the studied TITO system is parameter identifiable.

[0038] A4. The (minimal) value of U is defined as in Proposition 5 in [8].

[0039] A5. ∥θ∥<∞, i.e. θ₀ is an interior point of a compact set D_(M). Here, θ₀ contains the true parameters.

[0040] This section deals with the statistical analysis and it will begin with consistency. The asymptotic properties (as N-∞) of the estimate of θ_(N) (θ^ _(N)) is established in the following. However, first some preliminary observations are made. In [8] it was shown that

[0041] 1. As N→∞, {dot over (R)},₁,₂(k, θ)→R,₁,₂(k, θ) with probability one (w.p.1). Thus,

V_(N)(θ)→{overscore (V)}(θ), w.p.1,

[0042] where

{overscore (V)}(θ)= ${{\overset{\_}{V}(\theta)} = {\frac{1}{2}{r^{T}(\theta)}{W(\theta)}{r(\theta)}}},{{r(\theta)} = {\left\lbrack {{R_{s_{1}s_{2}}\left( {{- U},\theta} \right)}\quad \ldots \quad {R_{s_{1}s_{2}}\left( {U,\theta} \right)}} \right\rbrack^{T}.}}$

(θ)W(θ)τ(θ), τ(θ)=[R, ₁,₂(−U, θ) . . . R, ₁,₂(U, θ)]^(T).

[0043] The convergence in (3.1) is uniform in a set D_(M), where θ is a member ${{\lim\limits_{N->\infty}{\sup\limits_{\theta \in D_{M}}{{{V_{N}(\theta)} - {\overset{\_}{V}(\theta)}}}}} = 0},{{w.p}{{.1}.}}$

[0044] Furthermore, since the applied separation structure is of finite impulse response (FIR) type, the gradient is bounded ${{\max\limits_{1 \leq i \leq {n\theta}}\left\{ {\sup\limits_{\theta \in D_{M}}{\frac{\partial{V_{N}(\theta)}}{\partial\theta_{i}}}} \right\}} \leq {C\quad {w.p}{.1}}},$

[0045] for N larger than some N₀<∞. In equation (3.4), C is some constant, C<∞, and nθ denotes the dimension of θ. The above discussion, together with the identifiability analysis [8] then shows the following result:

[0046] Result 1 As N→∞,

{overscore (θ)}_(N)→θ₀ w/p.1.

[0047] Having established (strong) consistency, the asymptotic distribution of θ^ _(N) is considered. Since the θ^ _(N) minimizes the criterion V_(N)(θ), V_(N)(θ^ _(N))=0, where V_(N) denotes the gradient of V_(N). By the mean value theorem,

0=V _(N)′({dot over (θ)}_(N))=V _(N)′(θ₀)+V _(N)″(θ_(ξ))({dot over (θ)}_(N)−θ₀),

[0048] where θ_(ξ) is on a line between θ^ _(N) and θ₀. Note, since θ^ _(N) is consistent, the θ^ _(N)−θ₀ and consequently, θ_(ξ)→θ₀, as N→∞.

[0049] Next, investigate the gradient evaluated at θ₀ (for notational simplicity, let W(θ)=W) ${{V_{N}^{\prime}\left( \theta_{0} \right)} = {{{G^{T}W{{\hat{r}}_{N}\left( \theta_{0} \right)}} + {\frac{1}{2}\begin{bmatrix} {{{\hat{r}}_{N}^{T}\left( \theta_{0} \right)}\frac{\partial W}{\partial\theta_{1}}{{\hat{r}}_{N}\left( \theta_{0} \right)}} \\ \vdots \\ {{{\hat{r}}_{N}^{T}\left( \theta_{0} \right)}\frac{\partial W}{\partial\theta_{1}}{{\hat{r}}_{N}\left( \theta_{0} \right)}} \end{bmatrix}}_{\theta = \theta_{0}}} \simeq {G^{T}{{Wr}_{N}\left( \theta_{0} \right)}}}},$

[0050] where $\left( {{\hat{G} = \frac{\partial{{\hat{\tau}}_{N}(\theta)}}{\partial\theta}}} \right)_{\theta = \theta_{0}}.$

[0051] Note, evaluation of G is straightforward, see for example [8]. The introduced approximation does not affect the asymptotics, since the approximation error goes to zero at a faster rate than does the estimate of r_(N)(θ₀) (r^ _(N)(θ₀)). Furthermore, since r_(N)(θ₀)=0, the asymptotic distribution of V_(N)′(θ)

[0052] is identical to the asymptotic distribution of G^(T)Wr^ _(N)(θ₀), where $\left( {{G = \frac{\partial{\tau (\theta)}}{\partial\theta}}} \right)_{\theta = \theta_{0}}.$

[0053] Applying for example Lemma B.3 in [15], and using the fact that both s₁(n:θ₀) and s₂(n;θ₀) are stationary ARMA processes, one can show that ({square root}N)G^(T)Wr^ _(N)(θ₀) converges in distribution to a Gaussian random vector, i.e.

{square root}{square root over (N)}G^(T)W{dot over (r)}_(N)(θ₀)εAs.V(0, G^(T)WMWG),

[0054] where $M = {\lim\limits_{N->\infty}{N\quad {{E\left\lbrack {{{\overset{.}{\tau}}_{N}\left( \theta_{0} \right)}{{\overset{.}{\tau}}_{N}^{T}\left( \theta_{0} \right)}} \right\rbrack}.}}}$

[0055] This means that the gradient vector, is asymptotically normally distributed, with zero-mean and with a covariance matrix M.

[0056] Before presenting the main result of the current paper, the convergence of the Hessian matrix V″_(N) must be investigated. Assuming that the limit exists, define ${{\overset{\_}{V}}^{\prime\prime}(\theta)} = {\lim\limits_{N->\infty}{{V_{N}^{\prime\prime}(\theta)}.}}$

[0057] To establish the convergence of V″_(N)(θ_(ξ)), the following (standard) inequality is applied ${{{{V_{N}^{\prime\prime}\left( \theta_{\xi} \right)} - {{\overset{\_}{V}}^{\prime\prime}\left( \theta_{0} \right)}}}_{F} \leq {{{{V_{N}^{\prime\prime}\left( \theta_{\xi} \right)} - {V_{N}^{\prime\prime}\left( \theta_{0} \right)}}}_{F} + {{{V_{N}^{\prime\prime}\left( \theta_{0} \right)} - {{\overset{\_}{V}}^{\prime\prime}\left( \theta_{0} \right)}}}_{F}}},$

[0058] where ∥ ∥_(F) denotes the Frobenius norm. Due to the FIR separation structure, the second order derivatives are continuous. Moreover, since θ_(ξ) converges w.p.1 to θ₀, the first term converges to zero w.p.1. The second term converges also to zero w.p.1. This can be shown using a similar methodology that was used to show (3.3). Note also that since the third order derivatives are bounded, the convergence is uniform in θ.

[0059] It is, now, straightforward to see that the limiting Hessian V⁻″ can be written as $\begin{matrix} {{{\overset{\_}{V}}^{\prime\prime}\left( \theta_{0} \right)} = {{\lim\limits_{N->\infty}{V^{\prime\prime}\left( \theta_{0} \right)}} = {G^{T}W\quad G}}} & {{w.p}{.1}} \end{matrix}$

[0060] Thus, for large N,

{square root}{square root over (N)}({dot over (θ)}_(N)−θ₀)≅{square root}{square root over (N)}(G^(T)WG)⁻¹G^(T)W{dot over (τ)}N(θ₀),

[0061] assuming the inverses exists (generically guaranteed by the identifiability conditions in A3. Here all approximation errors that goes to zero faster than O (1/{square root}(N)) have been neglected. Finally, the following result can be stated.

[0062] Consider the signal separation method based on second order statistics, where θ^ _(N) is obtained from (2.10). Then the normalized estimation error, {square root}(N)(θ^ _(N)−θ_(N)), has a limiting zero-mean Gaussian distribution

{square root}{square root over (N)}({dot over (θ)}_(N)−θ₀)εAsN(0, P),

[0063] where

P=(G ^(T) WG)⁻¹ G ^(T) WMWG(G ^(T) WG)⁻¹.

[0064] Obviously, the matrix M plays a central role, and it is of interest to find a more explicit expression. For simplicity we consider only the case when the generating signals are zero-mean, Gaussian and white (as stated in Assumption A1). It seems to be difficult to find explicit expressions for the non-Gaussian case. Note also that this is really the place where the normality assumption in A1 is crucial. For example, the asymptotic normality of {square root}(N)r^ _(N)(θ₀) holds under weaker assumptions.

[0065] Theorem 6.4.1 in [5] indicates precisely how the components of M can be computed. These elements are actually rather easy to compute, as the following will demonstrate. Let $\beta_{\tau} = {\sum\limits_{p = {- \infty}}^{\infty}{{R_{s_{1}s_{1}}\left( {p;\theta_{0}} \right)}{{R_{s_{2}s_{2}}\left( {{p + \tau};\theta_{0}} \right)}.}}}$

[0066] Furthermore, introduce the following Z-transforms ${{\Phi_{1}(z)} = {\sum\limits_{k = {- \infty}}^{\infty}{{R_{s_{1}s_{1}}\left( {k;\theta_{0}} \right)}z^{- k}}}},{{\Phi_{2}(z)} = {\sum\limits_{k = {- \infty}}^{\infty}{{R_{s_{2}s_{2}}\left( {k;\theta_{0}} \right)}{z^{- k}.}}}}$

[0067] Then it follows that ${\sum\limits_{\tau = {- \infty}}^{\infty}{\sum\limits_{p = {- \infty}}^{\infty}{{R_{s_{1}s_{1}}\left( {p;\theta_{0}} \right)}{R_{s_{2}s_{2}}\left( {{p + \tau};\theta_{0}} \right)}z^{- \tau}}}} = {{\Phi_{1}\left( z^{- 1} \right)}{{\Phi_{2}(z)}.}}$

[0068] Thus, the β_(τ)'s are the covariances of an ARMA process with power spectrum ${{\Phi_{1}\left( z^{- 1} \right)}{\Phi_{2}(z)}} = {\sigma_{1}^{2}{\sigma_{2}^{2}\left( {1 - {{B_{12}(z)}{B_{21}(z)}}} \right)}^{2}\left( {1 - {{{\overset{\_}{B}}_{12}\left( z^{- 1} \right)}{{\overset{\_}{B}}_{21}\left( z^{- 1} \right)}}} \right){\frac{G_{1}(z)}{F_{1}(z)}}^{2}{{\frac{G_{2}(z)}{F_{2}(z)}}^{2}.}}$

[0069] Computation of ARMA covariances is a standard topic, and simple and efficient algorithms for doing this exists, see for example [15, Complement C7.7]. Given β_(τ)for τ=0 . . . , 2U, the weighting matrix can, hence, be constructed as $W = {\begin{bmatrix} \beta_{0} & \beta_{1} & \ldots & \beta_{2U} \\ \beta_{1} & \beta_{0} & ⋰ & \vdots \\ \vdots & \quad & ⋰ & \beta_{1} \\ \beta_{2U} & \ldots & \beta_{1} & \beta_{0} \end{bmatrix}.}$

[0070] Thus, in the present problem formulation the separated signals are distorted with the determinant of the channel system the channel system determinant equals det {B(z)}, and one may define the reconstructed signals as ${{{\overset{.}{x}}_{i}(n)} = {\frac{1}{\det \left\{ {D\left( {q,\overset{.}{\theta}} \right)} \right\}}{s_{i}\left( {n_{i}{\overset{.}{\theta}}_{N}} \right)}}},$

[0071] as long as det{D(q, θ₀)} is minimum phase.

[0072] To complete our discussion, it is also pointed out how the matrix G can be computed. The elements of G are all obtained in the following manner. Using Equation (2.8). it follows that $\frac{\partial{R_{s_{1}s_{2}}\left( {k;\theta} \right)}}{\partial{d_{21}(i)}} = {{- {R_{y_{1}y_{1}}\left( {k + i} \right)}} + {\sum\limits_{l}{{d_{12}(l)}{R_{y_{2}y_{1}}\left( {k - l + i} \right)}}}}$ $\frac{\partial{R_{s_{1}s_{2}}\left( {k;\theta} \right)}}{\partial{d_{21}(i)}} = {{- {R_{y_{2}y_{2}}\left( {k - i} \right)}} + {\sum\limits_{l}{{d_{21}(l)}{{R_{y_{2}y_{1}}\left( {k + i - l} \right)}.}}}}$

[0073] which are straightforward to compute.

[0074] Next, consider the problem of choosing W. Our findings are collected in the following result. The asymptotic accuracy of θ^ _(N), obtained as the minimizing argument of the criterion (2.10), is optimized if

W=W₀=M⁻¹

[0075] For this choice of weighting,

P(W ₀)=(G ^(T) M ⁻¹ G)⁻¹

[0076] The accuracy is optimized in the sense that P(W₀)−P(W) is positive semi-definite for all positive definite weighting matrices W.

[0077] The proof follows from well-known matrix optimization results, see for example [9, Appendix 2].

[0078] The result could have been derived directly from the ABC theory in [15, Complement C4.4]. However, the result above itself is a useful result motivating the presented analysis.

[0079] Before considering the actual implementation of the optimal weighting strategy, let us make a note on the selection of U. This parameter is a user-defined quantity, and it would be interesting to gain some insight into how it should be chosen. Note, Assumption A3 states a lower bound for U with respect to identifiability. The following result may be useful.

[0080] Assume that the optimal weighting W₀ is applied in the criterion (2.10). Let P_(U)(W) denote the asymptotic covariance for this case. Then

P _(U)(W ₀)≧P _(U-1)(W ₀)

[0081] The proof follows immediately from the calculations in [15, Complement C4.4]. Note that, when the optimal weighting, W₀ is applied the matrices {P_(U)(W₀)} forms a non-increasing sequence. However, in practice one must be aware that a too large value of U in fact may deteriorate the performance. This phenomenon may be explained by that a large value of U means that a larger value of N is required in order for the asymptotic results to be valid.

[0082] In the present section a comparison of signal separation based on an algorithm within the scope of the present invention and the algorithm in [8] will be made. The purpose for the comparison is to show the contribution of the present invention. Put differently, does the weighting lead to a significant decrease of the parameter variance? In all of our simulations, U=6. Furthermore, the term relative frequency is used in several figures. Here relative frequency corresponds to f_(rel)=2F/F_(S)where F_(S) is the sampling rate, e.g. f_(rel)=1 is equal to π.

[0083] Here the channel system is defined by B₁₂(q)=0.3+0.1q⁻¹ and B₂₁(q)=0.1+0.7q⁻¹. The source signal x₁(n) is an AR(2) process with poles at radius 0.8 and angles π/4. The second source signal is, also, an AR(2) process. However, the poles are moved by adjusting the angles in the interval [0,π/2], while keeping the radius constant at 0.8. At each angle 200 realizations have been generated and processed by the channel system and separation structure. That is to say, for each angle the resulting parameter estimates have been averaged. Finally, each realization consists of 4000 samples.

[0084] In FIG. 1 the empirical and true parameter variances are depicted. First, note the good agreement between the empirical and theoretical variances. Second, observe that the proposed weighting strategy for most angles give rise to a significant variance reduction. In FIG. 1, the parameter variances as a function of relative frequency. “*” empirical variance of the prior art signal separation algorithm; “+” empirical variance of the proposed weighting strategy. The solid line is the true asymptotic variance of the unweighted algorithm, and the dashed line is the true asymptotic variance for the optimally weighted algorithm. The dotted line is the CRB.

[0085] Apparently, it gets more difficult to estimate the channel parameters when the source colors are similar. Therefore, in FIGS. 2 and 3 a more careful examination of the parameter accuracy is presented. The angles of the poles are in the interval [40°, 50°]. In FIG. 2, the estimated mean value as a function of relative frequency. “*” empirical mean value of the prior art signal separation algorithm; “+” empirical mean value of the proposed weighting strategy. The solid lines correspond to the true parameter values. Note that the optimally weighted algorithm gets biased, although less biased than a prior art signal separation algorithm. This bias is probably an effect of the fact that the channel estimates of the unweighted algorithm are rather inaccurate, making the weighting matrix inaccurate as well. In FIG. 3, the parameter variances is depicted as a function of relative frequency; “*” empirical variance of the prior art signal separation algorithm [8]; “+” empirical variance of the proposed weighting strategy. The solid line is the true asymptotic variance of the unweighted algorithm, and the dashed line is the true asymptotic variance for the optimally weighted algorithm. The dotted line is the CRB. As is indicated by the FIGS. 1-3, the present invention increases the quality of the signal separation.

[0086] Further details of the present invention are that the method, according the device for separating signals, is repeatedly performed on the measured signal or on fractions thereof. Also, the method may be repeatedly performed according to a predetermined updating frequency. It should be noted that the predetermined updating frequency may not be constant. Further, the number of filter coefficients is predetermined. Finally, the number of filter coefficients is arranged to be predetermined in the above embodiment.

REFERENCES

[0087] [1] H. Broman, U. Lindgren, H. Sahlin, and P. Stoica. “Source Separation: A TITO System Identification Approach”. esp, 1994.

[0088] [2] D. C. B. Chan. Blind Signal Separation, PhD Thesis, University of Cambridge, 1997.

[0089] [3] F. Ehlers and H. G. Schuster. Blind separation of convolutive mixtures and an application in automatic speech recognition in a noisy environment. IEEE Trans. on Signal Processing 45(10):2608-2612, 1997.

[0090] [4] M. Feder, A. V. Oppenheim, and E. Weinstein. Maximum likelihood noise cancellation using the EM algorithm, IEEE Trans. on Acoustics, Speech, and Signal Processing, ASSP-37:204-216. February 1989.

[0091] [5] W. A. Fuller. Introduction to Statistical Time Series. John Wiley & Sons, Inc. New York, 1996.

[0092] [6] U. Lindgren, H. Sahlin and H. Broman. Multi input multi output blind signal separation using second order statistics. Technical Report CTH-TE-54, Department of Applied Electronics, 1996.

[0093] [7] U. Lindgren and H. Broman. “Monitoring the mutual Independence of the Output of Source Separation Algorithms”. In IEEE International Symposium on Information Theory and Its Applications, Victoria B.C., Canada, 1996.

[0094] [8] U- Lindgren and H. Broman. “Source Separation: Using a Criterion Based on Second Order Statistics”. IEEE Trans. on Signal Processing, SP-46(7), July, 1998.

[0095] [9] L. Ljung. System Identification: Theory for the User, Prentice-Hall, Englewood Cliffs. N.J., 1987.

[0096] [10] L. Ljung. Personal Communication, 1998.

[0097] [11D. Tuan Pham and P. Garat. “Blind Separation of Mixture of Independent Sources Through a Quasi-maximum Likelihood Approach”. IEEE Trans. on Signal Processing, SP-45: 1712-1725, July, 1997.

[0098] [12] H. Sahlin and H. Broman. “Separation of Real World Signals”. Signal Processing, 64(l):103-113, January, 1998.

[0099] [13] H. Sahlin and H. Broman. A decorrelation approach to blind mimo signal separation. In Proceedings of ICA, pages 383-388, 1999.

[0100] [14] H. Sahlin and U. Lindgren. “The Asymptotic Cramer-Rao Lower Bound for Blind Signal Separation”. In the Procedings of the 8th Signal Processing Workshop on Statistical Signal and Array Processing, pages 328-331, Corfu, Greece, 1996.

[0101] 15] T. Söderström and P. Stoica. System Identification. Prentice-Hall, London, U.K., 1989.

[0102] [16] L. Tong, Y. R. Liu, V. Soon, and Y. Huang. Indeterminancy and identifiability of blind identification.

[0103] [17] S. van Gerven and D. van Compernolle. Signal Separation by symmetric adaptive decorrelation: stability, convergence and uniqueness. IEEE Trans. on Signal Processing, 43:1602-1612, 1995.

[0104] [18] M. Viberg and A. L. Swindlehurst. “Analysis of the Combined Effects of Finite Samples and Model Errors on Array Processing Performance”. IEEE Trans. on Signal Processing, SP-42: 1-12, Nov. 1994.

[0105] [19] H. Wu and J. Principe. A unifying criterion for blind source separation and decorrelation: simultaneous diagonalization of correlation matrices In Proc. of NNSP97, pages 496-505, Amelia Island, Fla., 1997.

[0106] [20] H. Wu and J. Principe. Simultaneous diagonalization in the frequency domain (sdif) for source separation. In ICA, pages 245-250, Aussois, France, 1999. 

what is claimed is:
 1. A method for separating a mixture of source signals to regain the source signals, the method being based on measured signals, the method comprising: bringing each measured signal to a separation structure including an adaptive filter, the adaptive filter comprising filter coefficients; using a generalized criterion function for obtaining the filter coefficients, the generalized criterion function comprising cross correlation functions and a weighting matrix, the cross correlation functions being dependent on the filter coefficients; said weighting matrix, being an inverse matrix of a matrix comprising an estimation of a covariant matrix for a signal; said signal having a spectrum being a product of estimated spectrum of an incoming source-signal and the determinant of an estimated transformation function of a mixing filter; estimating the filter coefficients, the resulting estimates of the filter coefficients corresponding to a minimum value of the generalized criterion function; and updating the adaptive filter with the filter coefficients.
 2. The method according to claim 1, wherein said spectrum of the incoming source-signal is unknown and the weighting matrix considers an assumed spectrum.
 3. The method according to claim 1, wherein the weighting matrix is dependent on the filter coefficients.
 4. The method according to claim 1, wherein the method is repeatedly performed on the measured signal or on fractions thereof.
 5. The method according to claim 4, wherein the method is repeatedly performed according to a predetermined updating frequency.
 6. The method according to claim 1, wherein the number of filter coefficients is predetermined.
 7. A device for separating a mixture of source signals to regain the source signals, the input to the device being based on measured signals, the device comprising: signaling links for bringing each measured signal to a separation structure including an adaptive filter, the adaptive filter comprising filter coefficients; a generalized criterion function means for obtaining the filter coefficients, the generalized criterion function means comprising cross correlation functions and a weighting matrix, the cross correlation functions being dependent on the filter coefficients; said weighting matrix, being an inverse matrix of a matrix comprising an estimation of a covariant matrix for a signal; said signal having a spectrum being a product of estimated spectrum of an incoming source-signal and the determinant of an estimated transformation function of a mixing filter; means for estimating the filter coefficients, the resulting estimates of the filter coefficients corresponding to a minimum value output of the generalized criterion function; and updating means for updating the adaptive filter with the filter coefficients.
 8. The device according to claim 7, wherein the weighting matrix is dependent on the filter coefficients.
 9. The device according to claim 7, wherein the device is arranged to separate the measured signals or fractions thereof repeatedly.
 10. The device according to claim 9, wherein the device is arranged to separate the measured signals or fractions thereof according to a predetermined updating frequency.
 11. The device according to claim 7, wherein the number of filter coefficients is arranged to be predetermined. 